Before Authorship: Solomon and Prov. 1:1
نویسندگان
چکیده
منابع مشابه
The rationale of PROV
The prov family of documents are the final output of the World Wide Web Consortium Provenance Working Group, chartered to specify a representation of provenance to facilitate its exchange over the Web. This article reflects upon the key requirements, guiding principles, and design decisions that influenced the prov family of documents. A broad range of requirements were found, relating to the k...
متن کاملD-PROV: Extending the PROV Provenance Model with Workflow Structure
This paper presents an extension to the W3C PROV provenance model, aimed at representing process structure. Although the modelling of process structure is out of the scope of the PROV specification, it is beneficial when capturing and analysing the provenance of data that is produced by programs or other formally encoded processes. In the paper, we motivate the need for such extended model in t...
متن کاملPROV-man: A PROV-compliant toolkit for provenance management
6 Discoveries in modern science can take years and involve the contribution of large amounts of data, many 7 people and various tools. Although good scientific practice dictates that findings should be reproducible, in 8 practice there are very few automated tools that actually support traceability of the scientific method employed, 9 in particular when various experimental environments are inv...
متن کاملAuthorship in facilitated communication: an analysis of 11 cases.
We studied the authorship of messages produced through facilitated communication (FC) for all users of FC in two comprehensive schools in a small city in Finland. The participants were 11 children with intellectual disabilities, including autism, all having used FC from 1-3 years. The test conditions involved open and blind information-passing tasks in which the participants were directed to wr...
متن کاملNotes 11 : List Decoding Folded Reed - Solomon Codes
We would like to recover a list of all polynomials f ∈ F[X] of degree k whose folded RS encoding (1) agrees with y in at least t columns, for some agreement parameter t. The goal would be to give an algorithm for as small a t as possible, as this corresponds to list decoding up to n − t errors. Note that we can solve this problem for t ≥ √ RN by simply unfolding the received word and using the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biblical Interpretation
سال: 2018
ISSN: 0927-2569,1568-5152
DOI: 10.1163/15685152-00262p03